منابع مشابه
A Note on Domino Shuffling
We present a variation of James Propp’s generalized domino shuffling, which provides an efficient way to obtain perfect matchings of weighted Aztec diamonds. Our modification is specially tailored to deal with cases when some of the weights are zero. This allows us to tile efficiently a large class of planar graphs, by embedding them in a large enough Aztec diamond. We also give a sufficient co...
متن کاملOn a Problem in Shuffling
Suppose we take a deck of n cards, shuffle it in the usual way k times, and then deal the cards all out, again in the usual way, giving n j cards to each of j hands. We consider the following question: suppose we always start with a fresh deck, with cards in a fixed order; how large must k be, for given j and n, so that every possible set of j hands can be dealt? The special case j=n, in which ...
متن کاملOn Kelly networks with shuffling
We consider Kelly networks with shuffling of customers within each queue. Specifically, each arrival, departure or movement of customer from one queue to another triggers a shuffle of the other customers at each queue. The shuffle distribution may depend on the network state and on the customer that triggers the shuffle. We prove that the stationary distribution of the network state remains the...
متن کاملOn Transience of Card Shuffling
We present simple proofs of transience/recurrence for certain card shuffling models, that is, random walks on the infinite symmetric group. 1. Card shuffling models In this note, we consider several models of shuffling an infinite deck of cards. One of these models has been considered previously by Lawler [La]; our methods (using flows, shorting and comparison of Dirichlet forms) will – partial...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sen'i Gakkaishi
سال: 1977
ISSN: 0037-9875,1884-2259
DOI: 10.2115/fiber.33.8_t353